Stochastic safety radius on Neighbor-Joining method and Balanced Minimal Evolution on small trees

نویسندگان

  • Jing Xi
  • Jin Xie
  • Ruriko Yoshida
  • Stefan Forcey
چکیده

A distance-based method to reconstruct a phylogenetic tree with n leaves takes a distance matrix, n × n symmetric matrix with 0s in the diagonal, as its input and reconstructs a tree with n leaves using tools in combinatorics. A safety radius is a radius from a tree metric (a distance matrix realizing a true tree) within which the input distance matrices must all lie in order to satisfy a precise combinatorial condition under which the distance-based method is guaranteed to return a correct tree. A stochastic safety radius is a safety radius under which the distance-based method is guaranteed to return a correct tree within a certain probability. In this paper we investigated stochastic safety radii for the neighbor-joining (NJ) method and balanced minimal evolution (BME) method for n = 5.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Uniqueness of Balanced Minimum Evolution

Minimum evolution is a class of parsimonious distance-based phylogenetic reconstruction methods. One noteworthy example is balanced minimum evolution (BME), which is the theoretical underpinning of the neighbor-joining algorithm. The robustness of a minimum evolution method can be captured in part by a statistic known as its L∞ radius. BME is known to have L∞ radius 1 2 , the best possible. We ...

متن کامل

1 8 Fe b 20 07 THE NEIGHBOR - NET ALGORITHM

The neighbor-joining algorithm is a popular phylogenetics method for constructing trees from dissimilarity maps. The neighbor-net algorithm is an extension of the neighbor-joining algorithm and is used for constructing split networks. We begin by describing the output of neighbor-net in terms of the tessellation of M n 0 by associahedra. This highlights the fact that neighbor-net outputs a tree...

متن کامل

The Neighbor-Net Algorithm

The neighbor-joining algorithm is a popular phylogenetics method for constructing trees from dissimilarity maps. The neighbor-net algorithm is an extension of the neighbor-joining algorithm and is used for constructing split networks. We begin by describing the output of neighbor-net in terms of the tessellation of M n 0 (R) by associahedra. This highlights the fact that neighbor-net outputs a ...

متن کامل

Fe b 20 06 WHY NEIGHBOR - JOINING WORKS

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson’s optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson’s criterion is not satisfied. We also provide a proof for Atteson’s conjecture on the optimal edge radi...

متن کامل

The Geometry of the Neighbor-Joining Algorithm for Small Trees

In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstruction are each determined by a polyhedral subdivision of the space of dissimilarity maps R( n 2 ), where n is the number of taxa. In this paper, we will analyze the behavior of the Neighbor-Joining algorithm on five ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015